Maintaining Longest Paths Incrementally
نویسندگان
چکیده
منابع مشابه
Maintaining Longest Paths in Cyclic Graphs
This paper reconsiders the problem of maintaining longest paths in directed graphs, which is at the core of many scheduling applications. It presents bounded incremental algorithms for arc insertion and deletion running in time O(‖δ‖ + |δ| log |δ|) on Cyclic< 0 graphs (i.e., graphs whose cycles have strictly negative lengths), where |δ| and ‖δ‖ are measures of the change in the input and output...
متن کاملMaintaining Distributed Recursive Views Incrementally
Distributed logic programming languages, that allow bothfacts and programs to be distributed among different nodesin a network, have been recently proposed and used to declarativelyprogram a wide-range of distributed systems, such asnetwork protocols and multi-agent systems. However, the distributednature of the underlying systems poses serious challengesto developin...
متن کاملMaintaining Views Incrementally Extended Abstract
We present incremental evaluation algorithms to compute changes to materialized views in relational and deductive database systems, in response to changes (insertions, deletions, and updates) to the relations. The view deenitions can be in SQL or Datalog, and may use UNION, negation, aggregation (e.g. SUM, MIN), linear recursion, and general recursion. We rst present a counting algorithm that t...
متن کاملTransversals of Longest Paths
Let lpt(G) be the minimum cardinality of a set of vertices that intersects all longest paths in a graph G. Let ω(G) be the size of a maximum clique in G, and tw(G) be the treewidth of G. We prove that lpt(G) ≤ max{1,ω(G)− 2} when G is a connected chordal graph; that lpt(G) = 1 when G is a connected bipartite permutation graph or a connected full substar graph; and that lpt(G) ≤ tw(G) for any co...
متن کاملIncrementally maintaining classification using an RDBMS
The proliferation of imprecise data has motivated both researchers and the database industry to push statistical techniques into relational database management systems (RDBMSes). We study strategies to maintain model-based views for a popular statistical technique, classification, inside an RDBMS in the presence of updates (to the set of training examples). We make three technical contributions...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2005
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-005-0554-9